Improved TBL algorithm for learning context-free grammar
نویسندگان
چکیده
In this paper we introduce some improvements to the tabular representation algorithm (TBL) dedicated to inference of grammars in Chomsky normal form. TBL algorithm uses a Genetic Algorithm (GA) to solve partitioning problem, and improvements described here focus on this element of TBL. Improvements involve: i nitial population block size manipulation, block delete specialized operator and modified fitness function. The improved TBL algorithm was experimentally proved to be not so much vulnerable to block size and population size, and is able to find the solutions faster.
منابع مشابه
Grammatical Relations of Myanmar Sentences Augmented by Transformation-Based Learning of Function Tagging
In this paper we describe function tagging using Transformation Based Learning (TBL) for Myanmar that is a method of extensions to the previous statistics-based function tagger. Contextual and lexical rules (developed using TBL) were critical in achieving good results. First, we describe a method for expressing lexical relations in function tagging that statistical function tagging are currentl...
متن کاملGrapheme-to-phoneme conversion based on TBL algorithm in Mandarin TTS system
Grapheme-to-phoneme (G2P) conversion is an important component in a Text-to-Speech (TTS) system. The difficulty in Chinese G2P conversion is to pick out one correct pronunciation from several candidates according to the context information. By evaluating the distribution of polyphones in a corpus with manually corrected pinyin transcriptions, this paper pointed out that the overall error rate o...
متن کاملImproved genetic algorithm for the context-free grammatical inference
Inductive learning of formal languages, often called grammatical inference, is an active area in machine learning and computational learning theory. By learning a language we understand finding the grammar of the language when some positive (words from language) and negative examples (words that are not in language) are given. Learning mechanisms use the natural language learning model: people ...
متن کاملGrammar Induction and Genetic Algorithms: An Overview
Grammar Induction (also know as Grammar Inference or Language Learning) is the process of learning of a grammar from training data. This paper discusses the various approaches for learning context-free grammar (CFG) from the corpus of string and presents the approach of informant learning in the form of result for two standard grammar problems namely Balanced Parenthesis Grammar and Palindrome ...
متن کاملLearning Stochastic Context-Free Grammars from Corpora Using a Genetic Algorithm
A genetic algorithm for inferring stochastic context-free grammars from nite language samples is described. Solutions to the inference problem are evolved by optimizing the parameters of a covering grammar for a given language sample. We describe a number of experiments in learning grammars for a range of formal languages. The results of these experiments are encouraging and compare very favour...
متن کامل